Merging By Decentralized Eventual Consistency Algorithms

نویسندگان

  • Mehdi Ahmed-Nacer
  • Pascal Urso
  • François Charoy
چکیده

Merging mechanism is an essential operation for version control systems. When each member of collaborative development works on an individual copy of the project, software merging allows to reconcile modifications made concurrently as well as managing software change through branching. The collaborative system is in charge to propose a merge result that includes user’s modifications. T h e u s e rs n o w h a v e t o c h e ck a n d adapt this result. The adaptation should be as effort-less as possible, otherwise, the users may get frustrated and will quit the collaboration. This paper aims to reduce the conflicts d u r ing t h e c o l laboration a n d i m p rove t h e p r o ductivity. I t h a s three objectives: study the users’ behavior during the collaboration, evaluate the quality of textual merging results produced by specific a lgorithms a nd p ropose a s olution t o i mprove t he r esult q uality p roduced b y t he default merge tool of distributed version control systems. Through a study of eight open-source repositories totaling more than 3 million lines of code, we observe the behavior of the concurrent modifications d uring t he m erge p rocedure. We i dentified wh en th e ex isting merge techniques under-perform, and we propose solutions to improve the quality of the merge. We finally compare with the traditional merge tool through a large corpus of collaborative editing. Received on 27 February 2015 accepted on 19 January 2015; published on 21 December 2015

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Framework for Performance Evaluation of Decentralized Eventual Consistency Algorithms

Eventual Consistency (EC) model is adopted by numerous large-scale distributed systems. To ensure performance and scalability, this model allows any replica to accept updates without remote synchronization. Nowadays, many EC algorithms are developed to control the behavior of the replicated data in the face of concurrent updates. Among them, those using a central server to order the updates, wh...

متن کامل

Distributed B-Tree with Weak Consistency

B-tree is a widely used data-structure indexing data for efficient Retrieval. We consider a decentralized B-tree, were parts of the structure are distributed among different processors and some parts are replicated, thus providing a decentralized indexing structure and parallel operations as desired by modern-day cloud computing platforms. To accommodate the dynamic changes due to data insertio...

متن کامل

An Epistemic Perspective on Consistency of Concurrent Computations

Consistency properties of concurrent computations, e.g., sequential consistency, linearizability, or eventual consistency, are essential for devising correct concurrent algorithms. In this paper, we present a logical formalization of such consistency properties that is based on a standard logic of knowledge. Our formalization provides a declarative perspective on what is imposed by consistency ...

متن کامل

Delta State Replicated Data Types

CRDTs are distributed data types that make eventual consistency of a distributed object possible and non ad-hoc. Specifically, state-based CRDTs ensure convergence through disseminating the entire state, that may be large, and merging it to other replicas; whereas operation-based CRDTs disseminate operations (i.e., small states) assuming an exactly-once reliable dissemination layer. We introduc...

متن کامل

Partition Tolerance and Data Consistency in Structured Overlay Networks

Structured overlay networks form amajor class of peer-to-peer systems, which are used to build scalable, fault-tolerant and selfmanagingdistributed applications. This thesis presents algorithms for structured overlay networks, on the routing and data level, in the presence of network and node dynamism. On the routing level, we provide algorithms for maintaining the structure of the overlay, and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • EAI Endorsed Trans. Collaborative Computing

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2015